CSL-lean: A Theorem-prover for the Logic of Comparative Concept Similarity

نویسندگان

  • Régis Alenda
  • Nicola Olivetti
  • Gian Luca Pozzato
چکیده

The logic CSL of the comparative concept similarity has been introduced by Sheremet, Tishkovsky, Wolter and Zakharyaschev to capture a form of qualitative similarity comparison between concepts and/or objects. In this logic we can formulate assertions of the form “objects A are more similar to B than to C”. This kind of assertions can be added to an ontology to express qualitative comparisons between concepts. In this work we present CSL-lean, the first theorem-prover for this logic. It is a direct Prolog implementation of a tableaux-based decision procedure recently proposed for this logic. The Prolog program is inspired by the lean-methodology. CSL-lean also contains a graphical interface written in Java and it is available for free download at http://www.di.unito.it/~pozzato/csllean/.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Tableau calculi for CSL over minspaces

The logic of comparative concept similarity CSL has been introduced in 2005 by Shemeret, Tishkovsky, Zakharyashev and Wolter in order to express a kind of qualitative similarity reasoning about concepts in ontologies. The semantics of the logic is defined in terms of distance spaces; however it can be equivalently reformulated in terms of preferential structures, similar to those ones of condit...

متن کامل

leanCoP 2.0and ileanCoP 1.2: High Performance Lean Theorem Proving in Classical and Intuitionistic Logic (System Descriptions)

leanCoP is a very compact theorem prover for classical firstorder logic, based on the connection (tableau) calculus and implemented in Prolog. leanCoP 2.0 enhances leanCoP 1.0 by adding regularity, lemmata, and a technique for restricting backtracking. It also provides a definitional translation into clausal form and integrates “Prolog technology” into a lean theorem prover. ileanCoP is a compa...

متن کامل

lolliCop - A Linear Logic Implementation of a Lean Connection-Method Theorem Prover for First-Order Classical Logic

When Prolog programs that manipulate lists to manage a collection of resources are rewritten to take advantage of the linear logic resource management provided by the logic programming language Lolli, they can obtain dramatic speedup. Thus far this has been demonstrated only for “toy” applications, such as n-queens. In this paper we present such a reimplementation of the lean connection-calculu...

متن کامل

The concept of logic entropy on D-posets

In this paper, a new invariant called {it logic entropy} for dynamical systems on a D-poset is introduced. Also, the {it conditional logical entropy} is defined and then some of its properties are studied.  The invariance of the {it logic entropy} of a system  under isomorphism is proved. At the end,  the notion of an $ m $-generator of a dynamical system is introduced and a version of the Kolm...

متن کامل

An axiomatization and a tableau calculus for the logic of comparative concept similarity

Résumé : La logique de similarité comparative des concepts CSL a été introduite en 2005 par Shremet, Tishkowsky, Wolter et Zakharyaschev pour représenter des informations qualitatives sur la similarité entre des concepts, du type “A est plus similaire à B qu’à C”. La sémantique utilise des espaces de distances afin de représenter le degré de similarité entre objets du domaine. Dans cet article,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. Notes Theor. Comput. Sci.

دوره 262  شماره 

صفحات  -

تاریخ انتشار 2010